Saturated Graphs of Prescribed Minimum Degree
نویسندگان
چکیده
منابع مشابه
Light edges in 1-planar graphs with prescribed minimum degree
A graph is called 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. We prove that each 1-planar graph of minimum degree δ ≥ 4 contains an edge with degrees of its endvertices of type (4,≤ 13) or (5,≤ 9) or (6,≤ 8) or (7, 7). We also show that for δ ≥ 5 these bounds are best possible and that the list of edges is minimal (in the sense that, for each...
متن کاملLong cycles in graphs with prescribed toughness and minimum degree
A cycle C of a graph G is a D~-cycle if every component of G V(C) has order less than 2. Using the notion of D~-cycles, a number of results are established concerning long cycles in graphs with prescribed toughness and minimum degree. Let G be a t-tough graph on n/> 3 vertices. If 6 > n/(t + 2) + 2 2 for some 2 ~< t + 1, then G contains a Dx-cycle. In particular, if 6>n/(t+ 1)--1, then G is ham...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملMinimum degree and the minimum size of Kt 2 - saturated graphs Ronald
A graph G is said to be F-saturated if G does not contain a copy of F as a subgraph and G+ e contains a copy of F as a subgraph for any edge e contained in the complement of G. Erdős et al. in [A problem in graph theory, Amer. Math. Monthly 71 (1964) 1107–1110.] determined the minimum number of edges, sat(n, F ), such that a graph G on n vertices must have when F is a t-clique. Later, Ollmann [...
متن کاملAll minimum C5-saturated graphs
A graph is C5-saturated if it has no five-cycle as a subgraph, but does contain a C5 after the addition of any new edge. Extending our previous result, we prove that the minimum number of edges in a C5-saturated graph on n vertices is sat(n, C5) = ⌈10(n − 1)/7⌉ − 1 for 11 ≤ n ≤ 14, or n = 16, 18, 20, and is ⌈10(n − 1)/7⌉ for all other n ≥ 5, and we also prove that the only C5-saturated graphs w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2016
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548316000377